Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five
نویسنده
چکیده
Each parallel class of a uniformly resolvable design (URD) contains blocks of only one block size k (denoted k-pc). The number of k-pcs is denoted rk. The necessary conditions for URDs with v points, index one, blocks of size 3 and 5, and r3, r5 > 0, are v ≡ 15 (mod 30). If rk > 1, then v ≥ k2, and r3 = (v−1−4 · r5)/2. For r5 = 1 these URDs are known as group divisible designs. We prove that these necessary conditions are sufficient for r5 = 3 except possibly v = 105, and for r5 = 2, 4, 5 with possible exceptions (v = 105, 165, 285, 345) New labeled frames and labeled URDs, which give new URDs as ingredient designs for recursive constructions, are the key in the proofs. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four
Each parallel class of a uniformly resolvable design (URD) contains blocks of only one block size. AURDwith v points andwith block sizes three and fourmeans that at least one parallel class has block size three and at least one has block size four. Danziger [P. Danziger, Uniform restricted resolvable designs with r = 3, ARS Combin. 46 (1997) 161–176] proved that for all v ≡ 12 (mod 24) there ex...
متن کاملClass-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs
We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds. We present some general constructions including a novel construction for shrinking the index of a master de...
متن کاملOn vector space partitions and uniformly resolvable designs
Let Vn(q) denote a vector space of dimension n over the field with q elements. A set P of subspaces of Vn(q) is a partition of Vn(q) if every nonzero vector in Vn(q) is contained in exactly one subspace in P. A uniformly resolvable design is a pairwise balanced design whose blocks can be resolved in such a way that all blocks in a given parallel class have the same size. A partition of Vn(q) co...
متن کاملUniformly resolvable pairwise balanced designs with blocksizes two and three
A uniformly resolvable pairwise balanced design is a pairwise balanced design whose blocks can be resolved into parallel classes in such a way that all blocks in a given parallel class have the same size. We are concerned here with designs in which each block has size two or three, and we prove that the obvious necessary conditions on the existence of such designs are also sufficient, with two ...
متن کاملResolvable Modified Group Divisible Designs with Block Size Three
A resolvable modified group divisible design (RMGDD) is an MGDD whose blocks can be partitioned into parallel classes. In this article, we investigate the existence of RMGDDs with block size three and show that the necessary conditions are also sufficient with two exceptions. # 2005 Wiley Periodicals, Inc. J Combin Designs 15: 2–14, 2007
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009